
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1598. -- [Usaco2008 Mar]牛跑步 -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>1598: [Usaco2008 Mar]牛跑步</h2><span class=green>Time Limit: </span>10 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>162 MB<br><span class=green>Submit: </span>143&nbsp;&nbsp;<span class=green>Solved: </span>94<br>[<a href='submitpage.php?id=1598'>Submit</a>][<a href='problemstatus.php?id=1598'>Status</a>][<a href='bbs.php?id=1598'>Discuss</a>]</center><h2>Description</h2><div class=content>BESSIE准备用从牛棚跑到池塘的方法来锻炼. 但是因为她懒,她只准备沿着下坡的路跑到池塘,
然后走回牛棚.

BESSIE也不想跑得太远,所以她想走最短的路经. 农场上一共有M (1 <= M <= 10,000)条路,
每条路连接两个用1..N(1 <= N <= 1000)标号的地点. 更方便的是,如果X>Y,则地点X的高
度大于地点Y的高度. 地点N是BESSIE的牛棚;地点1是池塘.

很快, BESSIE厌倦了一直走同一条路.所以她想走不同的路,更明确地讲,她想找出K (1 <= K 
<= 100)条不同的路经.为了避免过度劳累,她想使这K条路经为最短的K条路经.

请帮助BESSIE找出这K条最短路经的长度.你的程序需要读入农场的地图, 一些从X_i到Y_i 
的路经和它们的长度(X_i, Y_i, D_i). 所有(X_i, Y_i, D_i)满足(1 <= Y_i < X_i; 
Y_i < X_i <= N, 1 <= D_i <= 1,000,000).
</div><h2>Input</h2><div class=content>* 第1行: 3个数: N, M, 和K

* 第 2..M+1行: 第 i+1 行包含3个数 X_i, Y_i, 和 D_i, 表示一条下坡的路.

</div><h2>Output</h2><div class=content>
* 第1..K行: 第i行包含第i最短路经的长度,或-1如果这样的路经不存在.如果多条路经有
同样的长度,请注意将这些长度逐一列出.

</div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>5 8 7<br />
5 4 1<br />
5 3 1<br />
5 2 1<br />
5 1 1<br />
4 3 4<br />
3 1 1<br />
3 2 1<br />
2 1 1<br />
<br />
</span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>1<br />
2<br />
2<br />
3<br />
6<br />
7<br />
-1<br />
<br />
输出解释:<br />
<br />
路经分别为(5-1), (5-3-1), (5-2-1), (5-3-2-1), (5-4-3-1),<br />
(5-4-3-2-1).<br />
</span></div><h2>HINT</h2>
			<div class=content><p></p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search=Gold'>Gold</a></p></div><center>[<a href='submitpage.php?id=1598'>Submit</a>][<a href='problemstatus.php?id=1598'>Status</a>][<a href='bbs.php?id=1598'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
